Inverse and Disjoint Connected Cototal Domination number of the Jump Graph of a Graph
نویسندگان
چکیده
منابع مشابه
connected cototal domination number of a graph
a dominating set $d subseteq v$ of a graph $g = (v,e)$ is said to be a connected cototal dominating set if $langle d rangle$ is connected and $langle v-d rangle neq phi$, contains no isolated vertices. a connected cototal dominating set is said to be minimal if no proper subset of $d$ is connected cototal dominating set. the connected cototal domination number $gamma_{ccl}(g)$ of $g$ is the min...
متن کاملConnected Cototal Domination Number of a Graph
A dominating setD ⊆ V of a graphG = (V,E) is said to be a connected cototal dominating set if 〈D〉 is connected and 〈V −D〉 6= ∅, contains no isolated vertices. A connected cototal dominating set is said to be minimal if no proper subset of D is connected cototal dominating set. The connected cototal domination number γccl(G) of G is the minimum cardinality of a minimal connected cototal dominati...
متن کاملThe convex domination subdivision number of a graph
Let $G=(V,E)$ be a simple graph. A set $Dsubseteq V$ is adominating set of $G$ if every vertex in $Vsetminus D$ has atleast one neighbor in $D$. The distance $d_G(u,v)$ between twovertices $u$ and $v$ is the length of a shortest $(u,v)$-path in$G$. An $(u,v)$-path of length $d_G(u,v)$ is called an$(u,v)$-geodesic. A set $Xsubseteq V$ is convex in $G$ ifvertices from all $(a, b)$-geodesics belon...
متن کاملTriple Connected Domination Number of a Graph
The concept of triple connected graphs with real life application was introduced in [7] by considering the existence of a path containing any three vertices of a graph G. In this paper, we introduce a new domination parameter, called Smarandachely triple connected domination number of a graph. A subset S of V of a nontrivial graph G is said to be Smarandachely triple connected dominating set, i...
متن کاملBounds on the restrained Roman domination number of a graph
A {em Roman dominating function} on a graph $G$ is a function$f:V(G)rightarrow {0,1,2}$ satisfying the condition that everyvertex $u$ for which $f(u) = 0$ is adjacent to at least one vertex$v$ for which $f(v) =2$. {color{blue}A {em restrained Roman dominating}function} $f$ is a {color{blue} Roman dominating function if the vertices with label 0 inducea subgraph with no isolated vertex.} The wei...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Research in Advent Technology
سال: 2019
ISSN: 2321-9637
DOI: 10.32622/ijrat.71201938